Facial age estimation using tensor based subspace learning and deep random forests
نویسندگان
چکیده
Recently, the estimation of facial age has attracted much attention. This letter extends and improves a recently developed method (Guehairia et al., 2020) for fusing multiple deep features estimation. was based on random forests. We propose new pipeline that integrates tensor-based subspace learning before applying DRFs. Deep face training set are represented as 3D tensor. Multi-linear Whitened Principal Component (MWPCA) Tensor Exponential Discriminant (TEDA) used to extract most discriminative information. The tensor then fed into DRFs predict age. Experiments conducted five public databases show our can compete with many state-of-the-art methods.
منابع مشابه
Objective Functions, Deep Learning and Random Forests
Introduction: Science A computer scientist seems an odd choice to speak either about science in the forest, or science in the past. Computer science is more often located in cities and offices than in forests, and is concerned with the challenges of the future rather than the past. ‘Science’ appears to be a point of enquiry shared with this symposium, but even this word is open to debate. It is...
متن کاملGroup-aware deep feature learning for facial age estimation
In this paper, we propose a group-aware deep feature learning (GA-DFL) approach for facial age estimation. Unlike most existing methods which utilize hand-crafted descriptors for face representation, our GA-DFL method learns a discriminative feature descriptor per image directly from raw pixels for face representation under the deep convolutional neural networks framework. Motivated by the fact...
متن کاملDeep Regression Forests for Age Estimation
Age estimation from facial images is typically cast as a nonlinear regression problem. The main challenge of this problem is the facial feature space w.r.t. ages is heterogeneous, due to the large variation in facial appearance across different persons of the same age and the nonstationary property of aging patterns. In this paper, we propose Deep Regression Forests (DRFs), an end-to-end model,...
متن کاملSubspace Learning Based on Tensor Analysis
Linear dimensionality reduction techniques have been widely used in pattern recognition and computer vision, such as face recognition, image retrieval, etc. The typical methods include Principal Component Analysis (PCA) which is unsupervised and Linear Discriminant Analysis (LDA) which is supervised. Both of them consider an m1 × m2 image as a high dimensional vector in Rm1×m2 . Such a vector r...
متن کاملLearning Markov random walks for robust subspace clustering and estimation
Markov Random Walks (MRW) has proven to be an effective way to understand spectral clustering and embedding. However, due to less global structural measure, conventional MRW (e.g., the Gaussian kernel MRW) cannot be applied to handle data points drawn from a mixture of subspaces. In this paper, we introduce a regularized MRW learning model, using a low-rank penalty to constrain the global subsp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2022
ISSN: ['0020-0255', '1872-6291']
DOI: https://doi.org/10.1016/j.ins.2022.07.135